منابع مشابه
Clustering Syntactic Positions with Similar Semantic Requirements
This article describes an unsupervised strategy to acquire syntactico-semantic requirements of nouns, verbs, and adjectives from partially parsed text corpora. The linguistic notion of requirement underlying this strategy is based on two specific assumptions. First, it is assumed that two words in a dependency are mutually required. This phenomenon is called here corequirement. Second, it is al...
متن کاملYour highness: vertical positions as perceptual symbols of power.
Metaphorically, power equals up. Drawing on embodied theories of cognition, the author argues that thinking about power involves mental simulation of space and can be interfered with by perception of vertical differences. Study 1 assessed image schemas for power and found a shared vertical difference metaphor. Studies 2, 3, and 4 showed that the judgment of a group's power is influenced by the ...
متن کاملReduction of Dimensionality for Perceptual Clustering
A b s t r a c t h a n d l e a t r e a l t i m e b u t a l s o t h a t s p a t i a l r e l a t i o n s h i p b e t w e e n d a t a i s c o n s e r v e d. H a v i n g a r o b u s t m e t h o d t h a t b u i l d s a b s t r a c t i o n s t h r o u g h l e a r n i n g f r o m t h e d a t a i t s e l f a n d t h a t p r o b a b i l i s t i c a l l y e s t i m a t e s t h e d y n a m i c s y s t e m ...
متن کاملSimulating Perceptual Clustering by Gestalt Principles
In this paper we propose a method for the detection of salient non-local structures in vector graphics. Non-local structures may consist of similar graphical objects—the constituents of a vector graphics—or of objects which are orderly arranged. They may be perceived immediately, but they are not explicitly represented in the internal description of a graphics. Information on such cognitive rel...
متن کاملPerceptual Grouping and Segmentation by Stochastic Clustering
We use cluster analysis as a unifying principle for problems from low, middle and high level vision. The clustering problem is viewed as graph partitioning, where nodes represent data elements and the weights of the edges represent pairwise similarities. Our algorithm generates samples of cuts in this graph, by using David Karger’s contraction algorithm, and computes an ”average” cut which prov...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEJ Transactions on Electronics, Information and Systems
سال: 2002
ISSN: 0385-4221,1348-8155
DOI: 10.1541/ieejeiss1987.122.2_313